task graph

An Application Framework Based on Task Graph for Mobile Ad Hoc Networks

移动ad hoc网中基于任务图应用的实现

This paper proposes a new algorithm for scheduling an Out-Tree task graph.

本文专门针对该类任务图，提出了一个新的调度算法。

The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.

针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。

It converts the ordinary task graph into fork and join graph, then apply the optimized result of fork and join graph to the scheduling of general task graph.

该算法把普通任务图转换为join与fork等基本形状，然后运用对join图与fork图的优化调度研究结果对这些基本形状进行任务调度。

This paper proposes an origin definition of heterogeneous task graph, which is a visual and valid description scheme of heterogeneous programs.

为此提出了异构任务图的定义，它是异构程序直观和有效描述方法。

Heterogeneous task graph scheduling in grid environment

异构任务图在网格环境中的调度实现

Multi-task graph is proposed since the single task graph is not enough to describe the multi-processors system, and MTLS algorithm is proposed to evaluate the performance of the partition.

针对单任务图描述多CPU系统结构的不足，提出采用多任务图来描述的方法，并提出了MTLS性能评估算法，验证系统软硬件划分的优劣。

The tree task of project decomposition and the serial relation between peer subtasks, and the node, branch and flow in network graph is introduced.

介绍了项目管理中，项目分解任务树和同级子任务间的串并关系，以及网络图中节点、枝线、流等3个构成要素。

Furthermore, we study an implementing model for heterogeneous task graph, which is the bridge between software and hardware in the environment of heterogeneous computing.

还研究了异构任务图的实现模型，它是异构计算环境中软件和硬件的桥梁。

The In-Tree task graph can be used to solve the parallel of divide-and-conquer problems, such as merging sorting and summing etc.

In-Tree任务图可用来求解归并排序、求和等分治问题的并行。

Scheduling of packet processing task graph on Pipelining network processors

流水线结构的网络处理器上包处理任务图的调度

The experimental work based on randomly generated task graph and a real world applications' task graph shows that the proposed algorithm provides substantial improvement over existing work on the communication contention aware model.

随机产生的任务图和一个具体应用的任务图进行调度试验的结果表明，该算法比已有调度算法的性能有了显著的提高。

Implementing Model for Heterogeneous Task Graph

异构任务图的实现模型

To prove the efficiency of the new algorithm, a certain task graph is scheduled as an example.

实例调度通过对具体任务图的调度结果分析验证新策略的高效性。

After that, the task graph model is introduced, which is suitable for time analysis on distributed multi-media systems.

之后，本文借鉴实时系统的任务图模型，提出了适于对分布式多媒体系统进行时间特性分析的任务图模型。

This paper presents a differential evolution algorithm to solve the multiprocessor scheduling problem with arbitrary task graph. Multiprocessor scheduling is a NP-hard problem, many papers employ heuristic.

本文主要基于现代启发式差分算法讨论多处理机调度，多处理机调度是NP组合优化问题，目前多采用启发算法。

A method of parallel program design based on task graph(ⅰ)── design of task graph

基于任务图的一种并行程序设计方法（Ⅰ）&任务图的设计

Finally, the author presents the denotation matrix of task graph, gives the partition algorithm that can decide quickly the mapping project on the mapping process-processor.

最后提出了任务图表示矩阵，对进程到处理器的映射问题给出了分割算法，这个算法能够快速确定进程到处理器的映射方案。

LSA_IT: Layered Scheduling Algorithm for In-Tree Task Graph

LSA IT：一种In-Tree任务图的分层调度算法

Task Graph Model and Its Foundation in Theory

TGM任务图模型和理论基础

First divide task graph into unrelated run-sequences to eliminate the relationship between tasks. Then allocate each run-sequence to one of cores.

该算法先将任务图分解为无关的执行序列，消除任务间的联系；然后为每个执行序列分配一个核。

The paper proposes a task graph based framework model and execution of distributed applications in mobile ad hoc networks.

论文提出了一个基于任务图的应用结构模型，以及它在移动ad hoc网中的实现。

New scheduling algorithm for Out-Tree task graph

一个调度Out-Tree任务图的新算法

To the periodic task graph of the band and complex cross feedback and gives the corresponding scheduling model, and embedded real-time operating system, proposed scheduling algorithm.

针对有向带环且有复杂的交叉反馈的周期性任务图给出了相应的调度模型，并嵌入实时操作系统，提出了调度算法。

Multi-Task graph is proposed since the single task graph is not enough to describe the multi-processors system.

并且针对单任务图描述多CPU系统结构的不足，提出采用多任务图来描述的方法。

Basing on the definitions of machine intelligence and human computer interface intelligence, we introduce a tool of modeling and analyzing system intelligence, namely an intelligent task graph, for the human machine cooperation system.

在定义机器智能和人机接口智能的基础上，为人机合作智能系统引入一个模拟和分析系统智能的工具，即智能任务图。

The concept of task graph and cost function are introduced. The algorithm not only takes computing time of a task into account, but also deals with communicating time.

它引入任务图与费用函数的概念，不仅考虑到任务的计算时间，还考虑到任务间的通信时间。

It schedules the task graph by level.

它对任务图逐层调度。

Proposing a new resource scheduling model and related task graph scheduling algorithms.

提出了一种分级的资源调度模型和相应的任务图调度算法。

Research of Generalized Fork-Join Task Graph Scheduling

广义Fork-Join任务图的调度问题研究